Connecting Lexicographic with Maximum Entropy Entailment
نویسندگان
چکیده
This paper reviews and relates two default reasoning mechanisms, lexicographic (lex) and maximum entropy (me) entailment. Meentailment requires that defaults be assigned speci c strengths and it is shown that lex-entailment can be equated to me-entailment for a class of speci c strength assignments. By clarifying the assumptions which underlie lex-entailment, it is argued that me-entailment is a superior method of handling default inference for reasons of both expressiveness and objective justi cation.
منابع مشابه
Probabilistic Default Reasoning with Strict and Defeasible Conditional Constraints Probabilistic Default Reasoning with Strict and Defeasible Conditional Constraints
We present an approach to reasoning about statistical knowledge and degrees of belief, which is based on a combination of probabilistic reasoning from conditional constraints and default reasoning from conditional knowledge bases. More precisely, we generalize the notions of Pearl's entailment in system , Lehmann's lexicographic entailment, and Geffner's conditional entailment to strict and def...
متن کاملNew Tractable Cases in Default Reasoning from Conditional Knowledge Bases
We present new tractable cases for default reasoning from conditional knowledge bases. In detail, we introduce q-Horn conditional knowledge bases, which allow for a limited use of disjunction. We show that previous tractability results for "-entailment, proper "-entailment, and zand z+-entailment in the Horn case can be extended to the q-Horn case. Moreover, we present feedback-freeHorn conditi...
متن کاملFirst Notes on Maximum Entropy Entailment for Quantified Implications
Entropy is a measure for the uninformativeness or randomness of a data set, i.e., the higher the entropy is, the lower is the amount of information. In the field of propositional logic it has proven to constitute a suitable measure to be maximized when dealing with models of probabilistic propositional theories. More specifically, it was shown that the model of a probabilistic propositional the...
متن کاملWeak Nonmonotonic Probabilistic Logics
We present an approach where probabilistic logic is combined with default reasoning from conditional knowledge bases in Kraus et al.’s System P , Pearl’s System Z, and Lehmann’s lexicographic entailment. The resulting probabilistic generalizations of default reasoning from conditional knowledge bases allow for handling in a uniform framework strict logical knowledge, default logical knowledge, ...
متن کاملProbabilistic Lexicographic Entailment under Variable-Strength Inheritance with Overriding
In previous work, I have presented approaches to nonmonotonic probabilistic reasoning, which is a probabilistic generalization of default reasoning from conditional knowledge bases. In this paper, I continue this exciting line of research. I present a new probabilistic generalization of Lehmann’s lexicographic entailment, called -entailment, which is parameterized through a value that describes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999